Internal Categoricity in Arithmetic and Set Theory
نویسندگان
چکیده
منابع مشابه
On Interpretations of Arithmetic and Set Theory
This would make an excellent starting point for any beginning research student working in the area of models of Peano arithmetic, since an understanding of how these interpretations work enables all coding techniques from set theory to be employed in arithmetic in a uniform way, and also places PA ‘on the map’ (in the sense of consistency and interpretation strength) relative to set theory. Thi...
متن کاملRelative set theory: Internal view
A nonstandard set theory with many levels of standardness was first proposed by Yves Péraire [28]. The theory GRIST formulated here is an extension of Péraire’s RIST. We prove that it is conservative and categorical over ZFC, and universal among theories of its kind. Technically, the paper carries out detailed analysis of the construction of internally iterated ultrapowers introduced in the aut...
متن کاملConsequences of Arithmetic for Set Theory
In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C ≤ D or D ≤ C. However, in ZF this is no longer so. For a given infinite set A consider seq 1 1 (A), the set of all sequences of A without repetition. We compare seq 1 1 (A) , the cardinality of this set, to P(A) , the cardinality of ...
متن کاملArithmetic Teichmuller Theory
By Grothedieck's Anabelian conjectures, Galois representations landing in outer automorphism group of the algebraic fundamental group which are associated to hyperbolic smooth curves defined over number fields encode all arithmetic information of these curves. The goal of this paper is to develope and arithmetic teichmuller theory, by which we mean, introducing arithmetic objects summarizing th...
متن کاملExecutable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The complete SWI-Prolog tested code is available at http://logic.csci.unt.edu/tarau/research/2008/pHFS.zip. First, ranking and unranking functions for some “mathematically elegant” data types in the univer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2015
ISSN: 0029-4527
DOI: 10.1215/00294527-2835038